SMT-based model checking for recursive programs

SMT-Based Model Checking for Recursive Programs

We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both overand under-approximations of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible...

SMT-based Symbolic Model Checking for Multi-Threaded Programs

Today, hyper-threading and multi-core hardware have become ubiquitous, putting us at a fundamental turning point in software development. In order for software applications to benefit from the continued exponential throughput advances in multi-core processors, applications will need to be multi-threaded software programs that are highly reliable. However, multi-threaded programs are notoriously...

SMT-Based Model Checking

Resource-Constrained Model Checking of Recursive Programs

A number of recent papers present efficient algorithms for LTL model checking for recursive programs with finite data structures. A common feature in all these works is that they consider infinitely long runs of the program without regard to the size of the program stack. Runs requiring unbounded stack are often a result of abstractions done to obtain a finite-data recursive program. In this pa...

Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking

We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities are definable in monadic second-order logic and that, in addition, allows PDL-like path expressions. This captures, in a unifying...